Equitable partition of graphs into induced forests
نویسندگان
چکیده
منابع مشابه
Edge Partition of Toroidal Graphs into Forests in Linear Time
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be embedded on the orientable surface of genus one without edge crossing, into three forests plus a set of at most three edges. For triangulated toroidal graphs, this algorithm gives a linear algorithm for finding three edge-disjoint spanning trees. This is in a certain way an extension of the well...
متن کاملSimple Planar Graph Partition into Three Forests
We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.‘s graph representation (1992) to label the planar graph vertices so that any two vertices’ adjacency can be tested locally by comparing their names in constant time.
متن کاملEdge-decomposing graphs into coprime forests
The Barát-Thomassen conjecture, recently proved in [3], asserts that for every tree T , there is a constant cT such that every cT -edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T -decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For i...
متن کاملA note on equitable colorings of forests
This note gives a short proof on characterizations of a forest to be equitably k-colorable.
متن کاملEquitable random graphs
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdős and Rényi, in particular, as well as the so-called configuration model, have served as the starting point for numerous calculations. In this paper we describe another large class of random graph models, which we call equitable random graphs and which are flexible enou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.03.019